-
1 AVL-tree
AVL-дерево (сбалансированное по высоте дерево, левое и правое поддеревья которого различаются по высоте не более чем на единицу)Большой англо-русский и русско-английский словарь > AVL-tree
-
2 AVL-tree
AVL-дерево (сбалансированное по высоте дерево, левое и правое поддеревья которого различаются по высоте не более чем на единицу)English-Russian dictionary of computer science and programming > AVL-tree
-
3 AVL tree
сбалансированное дерево, AVL-дерево, АВЛ-дерево, дерево АВЛ - см. balanced treeАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > AVL tree
-
4 AVL tree
Вычислительная техника: AVL-дерево, сбалансированное по высоте дерево -
5 AVL-tree
Программирование AVL-дерево Сбалансированное по высоте дерево, левое и правое поддеревья которого различаются по высоте не более чем на единицу.English-Russian dictionary of computer abbreviations and terms > AVL-tree
-
6 AVL tree
сбалансированное по высоте дерево; AVL-дерево -
7 AVL tree
-
8 AVL
1) Общая лексика: automatic vehicle location (АД)2) Авиация: automatic volume control3) Американизм: Absent Voters List4) Военный термин: approved vendors list5) Техника: avionics verification laboratory6) Юридический термин: Automated Vehicle Locator System7) Сокращение: Armoured Vehicle, Light, Automated Vehicle Location, Automatic Vehicle Location, сбалансированное по высоте дерево, AVL-дерево (AVL Tree( named after its founders: Adelson, Veiskii and Landis)), automobile vehicle locator8) Нефть: acoustic velocity log9) Химическое оружие: approved vendor list10) Расширение файла: AVL Tree (named after its founders: Adelson, Veiskii and Landis)11) Аэропорты: Asheville, North Carolina USA -
9 aVL
1) Общая лексика: automatic vehicle location (АД)2) Авиация: automatic volume control3) Американизм: Absent Voters List4) Военный термин: approved vendors list5) Техника: avionics verification laboratory6) Юридический термин: Automated Vehicle Locator System7) Сокращение: Armoured Vehicle, Light, Automated Vehicle Location, Automatic Vehicle Location, сбалансированное по высоте дерево, AVL-дерево (AVL Tree( named after its founders: Adelson, Veiskii and Landis)), automobile vehicle locator8) Нефть: acoustic velocity log9) Химическое оружие: approved vendor list10) Расширение файла: AVL Tree (named after its founders: Adelson, Veiskii and Landis)11) Аэропорты: Asheville, North Carolina USA -
10 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
11 tree
1) древовидная схема, дерево; древовидный дешифратор2) т.граф. дерево•- and-or tree
- AVL-tree
- balanced tree
- binary tree
- Boolean tree
- clock tree
- cluster tree
- collapsed tree
- decision tree
- depth-balanced tree
- derivation tree
- directed tree
- directory tree
- edge-valued binary decision tree
- exclusive tree
- expanded tree
- fan-out tree
- fault tree
- folded tree
- game tree
- height-balanced tree
- hierarchical tree
- inclusive tree
- incremented tree
- inverted tree
- Lupanov's tree
- minimum length tree
- N-bit parity tree
- overlay tree
- parity tree
- pattern tree
- position tree
- production tree
- radix tree
- rooted tree
- scope tree
- searching tree
- search tree
- selection tree
- shalloow tree
- sink tree
- skewed tree
- spanning tree
- specification tree
- syntactic tree
- syntax tree
- undirected tree
- upside down tree
- VLSI search tree
- word-level decision tree
- XOR treeEnglish-Russian dictionary of computer science and programming > tree
-
12 balanced tree
= B-tree IIдерево называется сбалансированным (или АВЛ-деревом - в честь его разработчиков G.M. Adelson-Velsky и Е.М. Landis), если для любой его вершины левое и правое поддеревья различаются по высоте не более чем на единицу. Хранение данных в виде сбалансированного дерева обеспечивает равнодоступность элементов данных.Syn:Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > balanced tree
-
13 Adel'son-Vel'ski-Landis tree
сбалансированное по высоте дерево, дерево Адельсона-Вельски-Лэндиса, AVL-деревоEnglish-Russian electronics dictionary > Adel'son-Vel'ski-Landis tree
См. также в других словарях:
AVL tree — In computer science, an AVL tree is a self balancing binary search tree, and it is the first such data structure to be invented. [Robert Sedgewick, Algorithms , Addison Wesley, 1983, ISBN 0 201 06672 6, page 199, chapter 15: Balanced Trees.] In… … Wikipedia
AVL tree — Arbre AVL Pour les articles homonymes, voir AVL. Un exemple d arbre non AVL. En informatique, les arbres AVL ont été his … Wikipédia en Français
AVL — can stand for any one of the following things:*AVL, the Austrian based (automotive) engineering consulting firm and research institute Anstalt für Verbrennungskraftmaschinen List *Acadèmia Valenciana de la Llengua (Valencian academy of the… … Wikipedia
Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree structure — A tree structure showing the possible hierarchical organization of an encyclopedia … Wikipedia
AVL — abbr. Adelson, Veslkij and Laudis (tree) comp. abbr. AVL Tree (named after its founders: Adelson, Veiskii and Landis) … United dictionary of abbreviations and acronyms
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
Splay tree — A splay tree is a self balancing binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look up and removal in O(log(n)) amortized time. For many… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
T-tree — In computer science a T tree is a type of binary tree data structure that is used by main memory databases, such as DataBlitz, e X treme DB, MySQL Cluster, Oracle TimesTen and [http://www.kairosdbms.com Kairos] [http://www.emware.co.kr… … Wikipedia
